Theory of Additive Cellular Automata
نویسندگان
چکیده
This paper reports the complete characterization of additive cellular automata (ACA) that employ xor and xnor logic as the next state function. Compared to linear cellular automata (LCA) [3], which employs only xor logic in its next state function, an ACA display much wider varieties of state transition behavior and enhanced computing power. An analytical framework is developed to characterize the cyclic vector subspaces generated by an ACA with reference to LCA. It identifies the conditions on which the state transition behavior of an ACA differs from that of the corresponding LCA and also provides the theoretical analysis of the nature of difference.
منابع مشابه
On the Measure Entropy of Additive Cellular Automata f∞
We show that for an additive one-dimensional cellular automata on space of all doubly infinitive sequences with values in a finite set S = {0, 1, 2, ..., r-1}, determined by an additive automaton rule f(x ∞ f n-k, ..., xn+k) = (mod r), and a -invariant uniform Bernoulli measure μ, the measure-theoretic entropy of the additive one-dimensional cellular automata with respect to μ is equal to h ∑ −...
متن کاملOn the ergodic properties of certain additive cellular automata over Zm
In this paper, we investigate some ergodic properties of Z-actions Tp,n generated by an additive cellular automata and shift acting on the space of all doubly -infinitive sequences taking values in Zm.
متن کاملChebyshev polynomials over finite fields and reversibility of -automata on square grids
Using number theory on function fields and algebraic number fields we prove results about Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional additive cellular automata on finite square grids. For example, we show that there are infinitely many primitive irreversible additive cellular automata on square grids when the base field has order two or three.
متن کاملBalanced Simplices
An additive cellular automaton is a linear map on the set of infinite multidimensional arrays of elements in a finite cyclic group Z/mZ. In this paper, we consider simplices appearing in the orbits generated from arithmetic arrays by additive cellular automata. We prove that they constitute a source of balanced simplices, that are simplices containing all the elements of Z/mZ with the same mult...
متن کاملAdditive One-Dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos
We study the chaotic behavior of a particular class of dynamical systems: cellular automata. We specialize the definition of chaos given by Devaney for general dynamical systems to the case of cellular automata. A dynamical system (X,F) is chaotic according to Devaney’s definition of chaos if its ~sition map F is sensitive to the initial conditions, topolo~cally transitive, and has dense period...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007